package ink.lovejinhu.leetcodeMatch;

/**
 * @author jinhu
 * created 2021-08-17 20:13
 */
public class Solution_1967 {
    public int numOfStrings(String[] patterns, String word) {
        int res = 0;
        for (int i = 0; i < patterns.length; i++) {
            if (word.contains(patterns[i])) {
                res++;
            }
        }
        return res;
    }
}
